On Mod Difference Labeling of Digraphs
نویسنده
چکیده
A digraph D = (V,E) is a mod difference digraph if there exist a positive integer m and a labeling L : V → {1, 2, . . . , m − 1} such that (x, y) ∈ E if and only if L(y) − L(x) ≡ L(w)(mod m) for some w ∈ V. In this paper we prove that complete symmetric digraphs, unipaths and unicycles are mod difference digraphs.
منابع مشابه
Further Results on Graceful Digraphs
A digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from {0, 1, ..., q} to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) = (g(v)− g(u))(mod q + 1). If the arc values are all distinct then the labeling is called a graceful labeling of a digraph. In this paper, we prove a general result on graceful digra...
متن کاملGeneralized graph cordiality
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonious labelings. If A is an abelian group, then a labeling f : V (G) → A of the vertices of some graph G induces an edgelabeling on G; the edge uv receives the label f(u) + f(v). A graph G is A-cordial if there is a vertex-labeling such that (1) the vertex label classes differ in size by at most one...
متن کاملA note on the Roman domatic number of a digraph
Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....
متن کاملSquare Difference 3-Equitable Labeling of Paths and Cycles
A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...
متن کاملSquare Difference 3-Equitable Labeling of Paths and Cycles
A square difference 3-equitable labeling of a graph G with vertex set V is a bijection f from V to {1, 2,.... | V | } jg such that if each edge uv is assigned the label -1 if |[f (u)]2 [f (v)]2 | = -1(mod 4), the label 0 if |[f (u)]2 [f (v)]2 | = 0(mod 4) and the label 1 if |[f (u)]2 [f (v)]| = 1(mod 4), then the number of edges labeled with i and the number of edges labelled with j differ by a...
متن کامل